package main.leetcode.clockin.June;

import java.util.List;

public class TestForSc {
    public static void main(String[] args) {
        //        Scanner scanner = new Scanner(System.in);
        //        int n = scanner.nextInt();
        //        String str = scanner.next();
        //        List<Integer> coins = new LinkedList<>();
        //        for (int i = 0; i < str.length(); ++i) {
        //            if (Character.isDigit(str.charAt(i))) {
        //                coins.add(str.charAt(i) - '0');
        //            }
        //        }
        //        System.out.println(solution(coins, n));
        String s = "12345";
        int n = s.length();
        System.out.println(s.substring(1, n - 1));
    }

    private static int solution(List<Integer> coins, int amount) {
        int[] dp = new int[amount + 1];
        dp[0] = 1;
        for (int coin : coins) {
            for (int i = coin; i <= amount; ++i) {
                dp[i] += dp[i - coin];
            }
        }
        return dp[amount];
    }
}
